Maximal Antichains of Minimum Size
نویسندگان
چکیده
منابع مشابه
Maximal Antichains of Minimum Size
Let n > 4 be a natural number, and let K be a set K ⊆ [n] := {1, 2, . . . , n}. We study the problem to find the smallest possible size of a maximal family A of subsets of [n] such that A contains only sets whose size is in K, and A 6⊆ B for all {A,B} ⊆ A, i.e. A is an antichain. We present a general construction of such antichains for sets K containing 2, but not 1. If 3 ∈ K our construction a...
متن کاملMaximal Flat Antichains of Minimum Weight
We study maximal families A of subsets of [n] = {1, 2, . . . , n} such that A contains only pairs and triples and A 6⊆ B for all {A,B} ⊆ A, i.e. A is an antichain. For any n, all such families A of minimum size are determined. This is equivalent to finding all graphs G = (V,E) with |V | = n and with the property that every edge is contained in some triangle and such that |E| − |T | is maximum, ...
متن کاملFull and maximal squashed flat antichains of minimum weight
A squashed full flat antichain (SFFA) in the Boolean lattice Bn is a family A∪B of subsets of [n] = {1, 2, . . . , n} such that, for some k ∈ [n] and 0 ≤ m ≤ ( n k ) , A is the family of the first m k-sets in squashed (reverse-lexicographic) order and B contains exactly those (k−1)-subsets of [n] that are not contained in some A ∈ A. If, in addition, every k-subset of [n] which is not in A cont...
متن کاملOn the size of maximal antichains and the number of pairwise disjoint maximal chains
Fix integers n and k with n ≥ k ≥ 3. Duffus and Sands proved that if P is a finite poset and n ≤ |C| ≤ n+ (n− k)/(k− 2) for every maximal chain in P , then P must contain k pairwise disjoint maximal antichains. They also constructed a family of examples to show that these inequalities are tight. These examples are 2-dimensional which suggests that the dual statement may also hold. In this paper...
متن کاملMaximal antichains under dimension constraints
We consider A(n, k) = maxA{|A| : dim(A) ≤ k, A ⊂ {0, 1} n is an antichain}, where the dimension is taken from the linear span of A in R, we conjecture the exact value of A(n, k) and we prove this conjecture for all n and k ≤ ⌊ n 2 ⌋ +1 or k = n−1. This is a contribution to the program of systematic investigation of extremal problems under dimension constraints, which was recently presented by t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2013
ISSN: 1077-8926
DOI: 10.37236/2736